Temporal Annotated Constraint Logic Programming
نویسندگان
چکیده
منابع مشابه
Temporal Annotated Constraint Logic Programming
We introduce a family of logics and associated programming languages for representing and reasoning about time. The family is conceptually simple while allowing for different models of time. Formulas can be labeled with temporal information using annotations. In this way we avoid the proliferation of variables and quantifiers as encountered in first order approaches. Unlike temporal logic, both...
متن کاملSemantics for Temporal Annotated Constraint Logic Programming
We investigate semantics of a considerable subset of Temporal Annotated Constraint Logic Programming (TACLP), a class of languages that allows us to reason about qualitative and quantitative, definite and indefinite temporal information using time points and time periods as labels for atoms. After illustrating the power of TACLP with some non-trivial examples, TACLP is given two different kinds...
متن کاملAnnotated Constraint Logic Programming Applied to Temporal Reasoning
Annotated constraint logic programming (ACLP) combines constraint logic programming (CLP) and generalized annotated programming (GAP). With ACL we propose a first order logic with constraints where formulas can be annotated. ACL comes with inference rules for annotated formulas and a constraint theory for handling annotations. We describe an implementation based on the standard interpreter for ...
متن کاملTowards Temporal Constraint Logic Programming
Eddie Schwalb2 and Llu s Vila3 Abstract. We aim at developing a logic-based representation language which supports an explicit representation of time and temporal constraints such as \the task t takes from 3 to 4 hours", \the resource r is available from 8:00 to 11:00 and from 13:00 to 14:00" and \task ti cannot overlap task tj". In this paper we discuss the issues to address and we propose TCL...
متن کاملAbduction in Annotated Logic Programming
Pragmatically, the logk programming paradigm presents a reasonable trade-off between expressive power and computational efficiency [9, 141. Here, we investigate techniques to make it more expressive for knowledge representation, while simultaneously retaining the computational advantages of efficiency and simplicity. In Section 1.1, we review annotated logic programs. In Section 1.2, we motivat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1996
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0066